Computer Classification of Linear Codes
نویسندگان
چکیده
Two algorithms for the classification of linear codes over finite fields are presented. One is based on canonical augmentation and other one lattice point enumeration. New results with 2, 3 4 elements obtained.
منابع مشابه
Classification of linear codes exploiting an invariant
We consider the problem of computing the equivalence classes of a set of linear codes. This problem arises when new codes are obtained extending codes of lower dimension. We propose a technique that, exploiting a simply computed invariant, allows us to reduce the computational complexity of the classification process. Using this technique the [13, 5, 8]7, the [14, 5, 9]8 and the [15, 4, 11]9 co...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملOn the classification of linear complementary dual codes
We give a complete classification of binary linear complementary dual codes of lengths up to 13 and ternary linear complementary dual codes of lengths up to 10.
متن کاملClassification of perfect linear codes with crown poset structure
Brualdi et al. introduced the concept of poset codes. In this paper, we consider the problem of classifying all perfect linear codes when the set of coordinate positions is endowed with crown poset structure. We derive a Ramanujan–Nagell type diophantine equation which is satis ed by parameters of perfect linear P-code. Solving this equation, we characterize parameters of one and two error corr...
متن کاملConstruction and classification of Z2s-linear Hadamard codes
The Z2s-additive and Z2Z4-additive codes are subgroups of Z n 2 and Z α 2 × Z β 4 , respectively. Both families can be seen as generalizations of linear codes over Z2 and Z4. A Z2s-linear (resp. Z2Z4-linear) Hadamard code is a binary Hadamard code which is the Gray map image of a Z2s-additive (resp. Z2Z4-additive) code. It is known that there are exactly ⌊ t−1 2 ⌋ and ⌊ t 2⌋ nonequivalent Z2Z4-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3114280